北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2011, Vol. 34 ›› Issue (6): 91-94.doi: 10.13190/jbupt.201106.91.yangb

• 研究报告 • 上一篇    下一篇

基于时间序列预测的延迟容忍网络路由算法研究

杨斌1,田勇2,檀傈锰2,章立军2,张卫冬2,张利欣2   

  1. 1. 北京科技大学
    2.
  • 收稿日期:2010-11-12 修回日期:2011-09-06 出版日期:2011-12-28 发布日期:2011-10-18
  • 通讯作者: 杨斌 E-mail:ustbyangbin@gmail.com
  • 作者简介:杨斌(1979-),男,讲师,E-mail:binyang@ustb.edu.cn
  • 基金资助:
    国家自然科学基金项目

Routing Algorithm based on Time Series Prediction in Delay Tolerant Networks

  • Received:2010-11-12 Revised:2011-09-06 Online:2011-12-28 Published:2011-10-18
  • Contact: Bin YANG E-mail:ustbyangbin@gmail.com

摘要:

本文提出了一种基于时间序列预测的延迟容忍网络路由算法。该算法通过改进的加权移动平均时间序列预测方法,利用节点中不断积累的历史连接信息,预测链路的未来连接状态,并以保证消息最早到达目标节点为路由选择依据,构建节点内部的路由表信息。本文算法不要求节点有任何网络连接的先验知识,并且能够随着网络拓扑的变化调整消息的传输路径,克服了同类算法需要大量网络连接先验知识而导致路由算法实用性差的问题,提高了算法的适用性。仿真结果表明,本文算法与MED、MEED算法相比,在不同的网络带宽和节点缓存条件下具有更高的传输成功率和更低的平均传输延迟。

Abstract:

A routing algorithm based on time series prediction for delay tolerant network is proposed. In this paper the weight moving average method which is one of time series prediction methods is improved, and the history connected information of nodes is used to predict the connection state in the future. Furthermore, the routing criterion is to ensure that messages reach the target node as much as possible soon. Any network connection information does not need, and the routing path can change followed with the change of network topology so that new routing table can be update immediately. The proposed algorithm can avoid the shortcoming of existing algorithm which needs amount of prior knowledge of routing information. So the proposed algorithm has strong applicability. The simulation experiment results have showed that the proposed algorithm compared with MED and MEED have higher delivery ratio and lower average time in different bandwidth and buffer size.

中图分类号: